认知无线电专题讲座(四) 第8讲 下一代网络:认知网络

认知网络是一种具有认知能力和认知过程的网络,它能够感知网络当前的状况,并根据当前的状况来计划、决定并行动。文中首先介绍了认知网络的基本概念及设计目标,然后描述了认知网络的特征和一种架构——CogNet。最后提出了认知网络的潜在应用及在今后的研究中需解决的几个主要问题。     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

基于移动代理的目标跟踪WSN体系结构设计

在目标跟踪WSN网络中,引入移动代理技术,选择性地访问传感器节点和融合数据,能极大地提高WSN网络的性能。提出了一种基于移动代理的WSN目标跟踪网络体系结构,对网络中的移动代理进行了分类,定义了各类移动代理的功能和结构,建立了基于移动代理的目标跟踪工作流程。最后通过仿真实验,验证了随着网络节点数量的增加,提出的目标跟踪WSN结构的与传统的C/S模式目标跟踪WSN结构相比,单位负载量等性能指标上具有较大的优势。     

面向服务的遗留系统再工程过程

将遗留系统再工程为面向服务系统是软件技术发展的趋势,但现有软件过程不能很好地解决面向服务的再工程所面临的问题.比如如何协调遗留系统共利益者的交流并快速有效地处理需求变更;如何实现服务以满足目标系统体系结构灵活性;如何降低重用遗留系统带来的风险以及如何减少交付期的软件错误等.针对这些问题,设计了面向服务的遗留系统再工程过程(SORP).SORP融合了传统软件过程的计划性和灵活性,并根据面向服务再工程项目的特点进行了特殊配置,在生命周期上将再工程过程划分为四个阶段,在内容上包含了六个工作流.为与实践相结合,详细规划了SORP的角色、活动、工作产品以及评估方法.应用实践表明,SORP在一定程度上增加了目标系统体系结构的灵活性,降低了重用遗留系统带来的风险.     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

机动目标IMM三维并行滤波跟踪算法

由于复杂的空中目标机动,其三维方向的机动强度是不一致的,传统IMM算法存在模型匹配不准确的问题,提出一种机动目标IMM三维并行滤波的跟踪算法。算法以CV和修正的CS模型为子集,在3个坐标轴上分别根据目标机动的分量实际更新其模型概率,并行IMM滤波方法,尽量确保模型的适配性,提高滤波精度。仿真结果表明,该算法比传统IMM方法跟踪精度更高,对空中机动目标跟踪适应性更强。     

基于物联网的战地装备安全监管问题研究

针对战地环境中军事装备的安全监管问题,分析了战地装备安全监管应用系统的整体结构与功能层次,给出了基于RFID射频识别技术、无线传感器等物联网技术的硬件平台设计方案,以及基于数据采集、分析、融合、传输和可视化技术研发监管控制软件的实现方案。该系统部署应用后可实现对装备实时、连续、精确的分级监管,能够确保装备管理的安全和高效,提高部队指挥决策能力。     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

基于警报关联的威胁行为检测技术综述

基于警报关联的网络威胁行为检测技术因其与网络上大量部署的安全产品耦合,且能充分挖掘异常事件之间的关联关系以提供场景还原证据,正成为复杂威胁行为检测的研究热点。从威胁行为和网络安全环境的特点出发,引出威胁行为检测的应用需求和分类,介绍基于警报关联的威胁行为检测的基本概念和系统模型;重点论述作为模型核心的警报关联方法,并分类介绍了各类典型算法的基本原理和特点,包括基于因果逻辑的方法、基于场景的方法、基于相似性的方法和基于数据挖掘的方法;并结合实例介绍了威胁行为检测系统的三种典型结构,即集中式结构、层次式结构和分布式结构;基于当前研究现状,提出了对未来研究趋势的一些认识。     

系统建模技术初探

为了对系统建模技术有一个总体认识,本文采用归纳和分析的方法,对系统建模技术的体系结构进行了初步探讨。